Open Problems Related to Quantum Query Complexity
نویسندگان
چکیده
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems—from relativized QMA versus QCMA BQP IP , to time/space tradeoffs for collision element distinctness, polynomial degree partial functions, the Unitary Synthesis Problem more.
منابع مشابه
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(...
متن کاملFrom Quantum Query Complexity to State Complexity
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general methods how to show state succinctness results for quantum finite automata. One such method is presented and demonstrated in this paper. In particular, we show that state succinctness results can be derived out of query c...
متن کاملExact quantum query complexity of weight decision problems
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding theory, fault-tolerant circuit design and so on. In particular, both Deutsch-Jozsa problem and Grover search problem can be interpreted as special cases of weight decision problems. In this work, we investigate the e...
متن کاملQuantum conditional query complexity
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associatedwith an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of the...
متن کاملNonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonadaptive quantum query algorithm that computes some total boolean function depending on n variables must make Ω(n) queries to the input in total. Second, we show that, if there exists a quantum algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on quantum computing
سال: 2021
ISSN: ['2643-6817', '2643-6809']
DOI: https://doi.org/10.1145/3488559